ParaDime is a framework for parametric dimensionality reduction (DR). In parametric DR, neural networks are trained to embed high-dimensional data items in a low-dimensional space while minimizing an objective function. ParaDime builds on the idea that the objective functions of several modern DR techniques result from transformed inter-item relationships. It provides a common interface to specify these relations and transformations and to define how they are used within the losses that govern the training process. Through this interface, ParaDime unifies parametric versions of DR techniques such as metric MDS, t-SNE, and UMAP. Furthermore, it allows users to fully customize each aspect of the DR process. We show how this ease of customization makes ParaDime suitable for experimenting with interesting techniques, such as hybrid classification/embedding models or supervised DR, which opens up new possibilities for visualizing high-dimensional data.

本文介绍了对聪明差异的检查，并以三个机会的层次进行了检查。当结果在波动的载荷下方时，将差异速度和力解释为三个结果的主要差异，但是当暴露于接近载荷时，将其等效的运动和力与其结果相等。确定的运动学和元素在三种不同的负担案件下进行了假设研究。此外，三个负担案件的移动也被重新创建并集中在其当前和潜在应用以及其当前和潜在应用的好处。

设计一个管道内的攀岩机器人，该机器人操纵锋利的齿轮以研究复杂的线关系。探索管道曲线时，传统的滚动/发生管道攀爬机器人往往会滑动。提议的变速箱连接到标准双输出变速箱的最远地面平面。仪器有助于实现一个非常明确的减速序列，在该序列中，机器人在向前移动时滑动和拉动。该仪器考虑了线路关系中每个轨道上施加的力，并有意修改机器人的轨道速度，从而解锁了微调的钥匙。这使得3个输出传输需要大量时间。机器人在具有各种轴承和防滑管道弯曲的管网上的挠度证明了所提出的结构的完整性。

管道内的攀岩机器人的蓝图，该机器人可与尖锐的传输一起研究复杂的线关系。探索管道转弯时，标准的轮式攀爬机器人往往会滑动。仪器有助于实现非常独特的延迟序列，在该顺序中，机器人随着进展而滑动和拖动。提议的变速箱连接了标准两输出变速器的最远地面平面。这为3个输出传输打开了大量时间。该仪器考虑了线路中每个轨道上施加的力，以专门改变机器人的轨道速度，从而解锁了良好控制的钥匙。机器人在具有不同轴承和防滑管道弯曲的管网上的挠度证明了所提出的结构的完整性。

虚拟测试是确保自动驾驶安全性的至关重要的任务，而传感器仿真是该域中的重要任务。大多数当前的激光雷达模拟非常简单，主要用于执行初始测试，而大多数见解是在道路上收集的。在本文中，我们提出了一种轻巧的方法，以实现更现实的激光雷达模拟，该方法从测试驱动器数据中学习了真实传感器的行为，并将其转换为虚拟域。核心思想是将仿真施加到图像到图像翻译问题中。我们将基于PIX2PIX的架构训练两个现实世界数据集，即流行的Kitti数据集和提供RGB和LIDAR图像的Audi自动驾驶数据集。我们将该网络应用于合成渲染，并表明它从真实图像到模拟图像充分概括。该策略使我们可以在我们的合成世界中跳过传感器特异性，昂贵且复杂的LIDAR物理模拟，并避免过度简化和通过干净的合成环境较大的域间隙。

Partial differential equations (PDEs) are important tools to model physical systems, and including them into machine learning models is an important way of incorporating physical knowledge. Given any system of linear PDEs with constant coefficients, we propose a family of Gaussian process (GP) priors, which we call EPGP, such that all realizations are exact solutions of this system. We apply the Ehrenpreis-Palamodov fundamental principle, which works like a non-linear Fourier transform, to construct GP kernels mirroring standard spectral methods for GPs. Our approach can infer probable solutions of linear PDE systems from any data such as noisy measurements, or initial and boundary conditions. Constructing EPGP-priors is algorithmic, generally applicable, and comes with a sparse version (S-EPGP) that learns the relevant spectral frequencies and works better for big data sets. We demonstrate our approach on three families of systems of PDE, the heat equation, wave equation, and Maxwell's equations, where we improve upon the state of the art in computation time and precision, in some experiments by several orders of magnitude.

Curating datasets for object segmentation is a difficult task. With the advent of large-scale pre-trained generative models, conditional image generation has been given a significant boost in result quality and ease of use. In this paper, we present a novel method that enables the generation of general foreground-background segmentation models from simple textual descriptions, without requiring segmentation labels. We leverage and explore pre-trained latent diffusion models, to automatically generate weak segmentation masks for concepts and objects. The masks are then used to fine-tune the diffusion model on an inpainting task, which enables fine-grained removal of the object, while at the same time providing a synthetic foreground and background dataset. We demonstrate that using this method beats previous methods in both discriminative and generative performance and closes the gap with fully supervised training while requiring no pixel-wise object labels. We show results on the task of segmenting four different objects (humans, dogs, cars, birds).

Unbiased learning to rank (ULTR) studies the problem of mitigating various biases from implicit user feedback data such as clicks, and has been receiving considerable attention recently. A popular ULTR approach for real-world applications uses a two-tower architecture, where click modeling is factorized into a relevance tower with regular input features, and a bias tower with bias-relevant inputs such as the position of a document. A successful factorization will allow the relevance tower to be exempt from biases. In this work, we identify a critical issue that existing ULTR methods ignored - the bias tower can be confounded with the relevance tower via the underlying true relevance. In particular, the positions were determined by the logging policy, i.e., the previous production model, which would possess relevance information. We give both theoretical analysis and empirical results to show the negative effects on relevance tower due to such a correlation. We then propose three methods to mitigate the negative confounding effects by better disentangling relevance and bias. Empirical results on both controlled public datasets and a large-scale industry dataset show the effectiveness of the proposed approaches.

G-Enum histograms are a new fast and fully automated method for irregular histogram construction. By framing histogram construction as a density estimation problem and its automation as a model selection task, these histograms leverage the Minimum Description Length principle (MDL) to derive two different model selection criteria. Several proven theoretical results about these criteria give insights about their asymptotic behavior and are used to speed up their optimisation. These insights, combined to a greedy search heuristic, are used to construct histograms in linearithmic time rather than the polynomial time incurred by previous works. The capabilities of the proposed MDL density estimation method are illustrated with reference to other fully automated methods in the literature, both on synthetic and large real-world data sets.

Neural Radiance Fields (NeRFs) are emerging as a ubiquitous scene representation that allows for novel view synthesis. Increasingly, NeRFs will be shareable with other people. Before sharing a NeRF, though, it might be desirable to remove personal information or unsightly objects. Such removal is not easily achieved with the current NeRF editing frameworks. We propose a framework to remove objects from a NeRF representation created from an RGB-D sequence. Our NeRF inpainting method leverages recent work in 2D image inpainting and is guided by a user-provided mask. Our algorithm is underpinned by a confidence based view selection procedure. It chooses which of the individual 2D inpainted images to use in the creation of the NeRF, so that the resulting inpainted NeRF is 3D consistent. We show that our method for NeRF editing is effective for synthesizing plausible inpaintings in a multi-view coherent manner. We validate our approach using a new and still-challenging dataset for the task of NeRF inpainting.